Minimum-Size Mixed-Level Orthogonal Fractional Factorial Designs Generation: ASAS-Based Algorithm

Generalized Resolution and Minimum Aberration for Nonregular Fractional Factorial Designs

Seeking the optimal design with a given number of runs is a main problem in fractional factorial designs(FFDs). Resolution of a design is the most widely usage criterion, which is introduced by Box and Hunter(1961), used to be employed to regular FFDs. The resolution criterion is extended to non-regular FFG, called the generalized resolution criterion. This criterion is providing the idea of ge...

Generation of Fractional Factorial Designs

The joint use of counting functions, Hilbert basis and Markov basis allows to define a procedure to generate all the fractions that satisfy a given set of constraints in terms of orthogonality. The general case of mixed level designs, without restrictions on the number of levels of each factor (like primes or power of primes) is studied. This new methodology has been experimented on some signif...

Construction of Efficient Fractional Factorial Mixed-Level Designs

Cluster Orthogonal Arrays and Optimal Fractional Factorial Designs

A generalization of orthogonal arrays, namely cluster orthogonal arrays (CLOA), is introduced and some properties and construction methods are studied. The universal optimality of the fractional factorial designs represented by cluster orthogonal arrays is proved.

Graph based isomorph-free generation of two-level regular fractional factorial designs

Article history: Received 2 August 2008 Received in revised form 1 July 2009 Accepted 2 July 2009 Available online 9 July 2009